An asymptotically exact polynomial algorithm for equipartition problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon’s problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the wors...

متن کامل

An exact algorithm for graph coloring with polynomial memory

In this paper, we give an algorithm that computes the chromatic number of a graph in O(5.283n) time and polynomial memory.

متن کامل

An Exact Algorithm for the Mode Identity Project Scheduling Problem

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...

متن کامل

An Exact Algorithm for Location–Transportation Problems in Humanitarian Relief

Abstract—This paper proposes a mathematical model and examines the performance of an exact algorithm for a location– transportation problems in humanitarian relief. The model determines the number and location of distribution centers in a relief network, the amount of relief supplies to be stocked at each distribution center and the vehicles to take the supplies to meet the needs of disaster vi...

متن کامل

Exact and Asymptotically Exact Solutions for a Class of Assortment Problems

1. Enforcing the master problem formulation If constraint (16) is not included in formulation (15), the pricing problem may yield unfea-sible assortment patterns. However, as noted in §4.1, this constraint increases the pricing complexity, and is therefore unpractical. To limit the amount of unfeasible columns generated, one can observe that, due to (9), knapsack constraints of the form S⊆J |S|...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1986

ISSN: 0166-218X

DOI: 10.1016/0166-218x(86)90032-6